Reasoning about GSTE Assertion Graphs
نویسندگان
چکیده
منابع مشابه
Maximal Models of Assertion Graph in GSTE
Generalized symbolic trajectory evaluation (GSTE) is an extension of symbolic trajectory evaluation (STE). In GSTE, assertion graphs are used to specify properties in a special form of regular automata with antecedent and consequent pairs. This paper presents a new model characterization, called maximal models, for an assertion graph with important properties. Besides their own theoretical sign...
متن کاملA Transformation-Based Approach to Implication of GSTE Assertion Graphs
Generalized symbolic trajectory evaluation (GSTE) is a model checking approach and has successfully demonstrated its powerful capacity in formal verification of VLSI systems. GSTE is an extension of symbolic trajectory evaluation (STE) to themodel checking of ω-regular properties. It is an alternative to classical model checking algorithms where properties are specified as finite-state automata...
متن کاملSatgste: Combining the Abstraction of Gste with the Capacity of a Sat Solver
GSTE (Generalized Symbolic Trajectory Evaluation) is a model checking technique based on symbolic simulation 4]. GSTE is a very signiicant extension of STE 2], 3] that combines the eeciency, capacity and ease of use of STE with the ability of classic symbolic model checking for verifying a rich set of properties on very large HW designs. GSTE has vastly demonstrated its viability for full forma...
متن کاملA Faithful Semantics for Generalised Symbolic Trajectory Evaluation
Generalised Symbolic Trajectory Evaluation (GSTE) is a high-capacity formal verification technique for hardware. GSTE is an extension of Symbolic Trajectory Evaluation (STE). The difference is that STE is limited to properties ranging over finite time-intervals whereas GSTE can deal with properties over unbounded time. GSTE uses abstraction, meaning that details of the circuit behaviour are rem...
متن کاملTableaux and Resource Graphs for Separation Logic
Separation Logic (SL) is often presented as an assertion language for reasoning about mutable data structures. As recent results about verification in SL have mainly been achieved from a model-checking point of view, our aim in this paper is to study Separation Logic from a complementary proof-theoretic perspective in order to provide results about proof-search in SL. We begin our study with a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003